Deening a `doughnut' Made Diicult
نویسنده
چکیده
Qualitative descriptions of spatial properties and relationships, and qualitative spatial reasoning, are of fundamental importance in human problem-solving: even where we use quantitative approaches, these depend on an accompanying qualitative representation. The work described is aimed at for-malising some topological aspects of qualitative spatial description and reasoning. The paper continues the work of Randell, Cohn and Cui on region-based qualitative representations of spatial properties and relations, built on thèlogic of connection' developed by Clarke. It is shown how taxonomies of the topological properties and relationships of spatial regions can be developed, using the single primitivèC', wherèC(x; y)' indicates that regions x and y arèconnected', meaning that their closures share at least one point. This is done by considering a speciic task: deciding whether or not a region has the topology of a `doughnut', or solid torus. A range of`near misses' and doubtful cases is discussed, and ways of distinguishing these from thètarget', the solid torus, are considered. It is shown how the task could be performed given certain assumptions about the target region and about regions in general. These assumptions are then progressively relaxed; as this is done, the task requires the deenition of successive layers of terminology, all derived ultimately from`C', and providing a basis for successively broader taxonomies of topological properties and relationships.
منابع مشابه
Topology from a Single Primitive Relation: Deening Topological Properties and Relations in Terms of Connection 1
Topological formalisms adaptable to a wide range of applications in spatial information systems (SIS) are a highly desirable research goal. The paper discusses a candidate formalism, the region-basedìogic of connection' of Randell, Cohn and Cui. This is based on the single primitivèC' (wherèC(x; y)' indicates that spatial regions x and y arèconnected'). The originators of this approach (`RCC th...
متن کاملViews for Semistructured
Deening a view over a semistructured database introduces many new problems. In this paper we propose a view speciication language and consider the problem of answering queries posed over views. The two main approaches, query rewriting and view materialization, are outlined with focus on the diicult problems caused by the semistructured nature of the data.
متن کاملUtilizing Behavioral Abstractions to Facilitate Maintenance During Class Evolution
Software maintenance can be a diicult and time consuming process. To facilitate this process, application development must produce software that is designed to continually evolve. While object oriented methodologies address some of the maintenance issues that have troubled traditional functional techniques, object oriented development must overcome the problems involved in maintaining existing ...
متن کاملOn the Design of an Indexical Query Language
For the past twenty years, the relational model has been the norm for deening databases. The model is simple to understand, has a clear semantics and is easy to use. However, relational algebra is unable to solve certain problems. In particular, it is impossible to express such simple concepts as the transitive closure of a binary relation. Furthermore, the relational algebra itself ooers no me...
متن کاملof the International Conference on Knowledge Representation and Reasoning , Cambridge , MA
The AGM rationality postulates for belief revision play an important role in the formal-ization of subjunctive queries over knowledge bases. However, the well known triviality results by GG ardenfors in connection with the Ramsey Test make deening a query semantics corresponding to these rationality postulates a diicult task. While existing approaches avoid the triviality results by restricting...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994